Some Examples of Constructive and Non-constructive Extensions of the Countable Atomless Boolean Algebra

نویسندگان

  • E. W. MADISON
  • G. C. NELSON
چکیده

There are two main results concerning the nature of constructive extensions of the countable atomless Boolean algebra, say 28 a, which appear in [1]. These results are (I) if <& is a constructive extension of 23a, then each element of # is recursive open and regular, and (II) the characterization of the simple constructive extensions 28JJJ) as those for which U is recursive open and regular. We note that by extension 28 of 28 a we mean an extension of 28 a such that 28 is a subalgebra of the completion $a, the Boolean algebra of regular open sets [2]. The results (I) and (II) are true for constructive extensions of an arbitrary computable Boolean algebra; however, at that time the only known constructive extensions of 28 a were obtained by (II), while the only non-constructive extensions of 28 a were either uncountable or obtained from 2ft a by adjoining regular elements which were not recursive open, i.e., these extensions were non-constructive on the basis of cardinality or by (I). Eventually, in [3], the first author produced examples of non-simple constructive extensions of 28 a. In the present work we produce non-constructive extensions of 28 a each of whose elements is recursive open and regular. In addition, we produce for each recursive ordinal a a-chains with respect to (strongly) constructive extension over 28a. The main tool used in obtaining these results is the construction, for any constructive extension # of 28 a, of a strongly constructive extension of 6.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complete Embeddings of the Cohen Algebra into Three Families of C.c.c., Non-measurable Boolean Algebras

Von Neumann conjectured that the countable chain condition and the weak (ω, ω)-distributive law characterize measurable algebras among Boolean σalgebras [Mau]. Consistent counter-examples have been obtained by Maharam [Mah], Jensen [J], Glówczyński [Gl], and Veličković [V]. However, whether von Neumann’s proposed characterization of measurable algebras fails within ZFC remains an open problem. ...

متن کامل

Regular Subalgebras of Complete Boolean Algebras

It is proved that the following conditions are equivalent: (a) there exists a complete, atomless, σ–centered Boolean algebra, which does not contain any regular, atomless, countable subalgebra, (b) there exists a nowhere dense ultrafilter on ω. Therefore the existence of such algebras is undecidable in ZFC. In ”forcing language” condition (a) says that there exists a non– trivial σ–centered for...

متن کامل

1 5 D ec 1 99 7 REGULAR SUBALGEBRAS OF COMPLETE BOOLEAN ALGEBRAS

There is shown that there exists a complete, atomless, σ-centered Boolean algebra, which does not contain any regular countable subalgebra if and only if there exist a nowhere dense ultrafilter. Therefore the existence of such algebras is undecidable in ZFC. A subalgebra B of a Boolean algebra A is called regular whenever for every X ⊆ B, supB X = 1 implies supA X = 1; see e.g. Heindorf and Sha...

متن کامل

Constructive algebraic integration theory without choice

We present a constructive algebraic integration theory. The theory is constructive in the sense of Bishop, however we avoid the axiom of countable, or dependent, choice. Thus our results can be interpreted in any topos. Since we avoid impredicative methods the results may also be interpreted in Martin-L type theory or in a predicative topos in the sense of Moerdijk and Palmgren. We outline how ...

متن کامل

Learning Highly Non-separable Boolean Functions Using Constructive Feedforward Neural Network

Learning problems with inherent non-separable Boolean logic is still a challenge that has not been addressed by neural or kernel classifiers. The k-separability concept introduced recently allows for characterization of complexity of non-separable learning problems. A simple constructive feedforward network that uses a modified form of the error function and a window-like functions to localize ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006